Understanding of Heterogeneous Multi-Stage Meta-Programs
نویسندگان
چکیده
The paper analyzes an approach to understanding heterogeneous meta-programs and multi-stage metaprograms. At the core of the approach is human-centred analysis combined with the Brook’s program cognition theory and the concept of reverse engineering. The use of the approach leads to extracting higher-level models (graphs representing meta-parameter — meta-function relationship models, feature diagrams and algorithms) from correct meta-specifications. The models and processes enable not only to better understand the multi-stage heterogeneous meta-programs but also to contribute to their evolution. The paper describes some properties of the multi-stage heterogeneous meta-programs. The approach is supported by the case study and complexity evaluation.
منابع مشابه
Verifying heterogeneous multi-agent programs
We present a new approach to verifying heterogeneous multi-agent programs — multi-agent systems in which the agents are implemented in different (BDI-based) agent programming languages. Our approach is based on meta-APL, a BDI-based agent programming language that allows both an agent’s plans and its deliberation strategy to be encoded as part of the agent program. The agent programs comprising...
متن کاملEquivalent Transformations of Heterogeneous Meta-Programs
We consider a generalization of heterogeneous meta-programs by (1) introducing an extra level of abstraction within the meta-program structure, and (2) meta-program transformations. We define basic terms, formalize transformation tasks, consider properties of meta-program transformations and rules to manage complexity through the following transformation processes: (1) reverse transformation, w...
متن کاملSolving a multi-depot location-routing problem with heterogeneous vehicles and fuzzy travel times by a meta-heuristic algorithm
A capacitated location-routing problem (CLRP) is one of the new areas of research in distribution management. It consists of two problems; locating of facilities and routing of the vehicle with a specific capacity. The purpose of the CLRP is to open a set of stores, allocate customers to established deposits, and then design vehicle tours in order to minimize the total cost. In this paper, a ne...
متن کاملA Comparison of NSGA II and MOSA for Solving Multi-depots Time-dependent Vehicle Routing Problem with Heterogeneous Fleet
Time-dependent Vehicle Routing Problem is one of the most applicable but least-studied variants of routing and scheduling problems. In this paper, a novel mathematical formulation of time-dependent vehicle routing problems with heterogeneous fleet, hard time widows and multiple depots, is proposed. To deal with the traffic congestions, we also considered that the vehicles are not forced to come...
متن کاملRefactoring of Heterogeneous Meta-Program into k-stage Meta-Program
The paper presents: (1) a graph-based theoretical background to refactoring a correct heterogeneous meta-program into its k-stage representation; (2) the refactoring method; (3) refactoring experiments with tasks taken from different domains, including real world tasks, such as meta-programs to teach Computer Science (CS) topics using educational robots. Refactoring meta-programs by staging ena...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- ITC
دوره 41 شماره
صفحات -
تاریخ انتشار 2012